Small Secure Sketch for Point-Set Difference
نویسندگان
چکیده
A secure sketch is a set of published data that can help to recover the original biometric data after they are corrupted by permissible noises, and by itself does not reveal much information about the original. Several constructions have been proposed for different metrics, and in particular, set difference. We observe that in many promising applications, set difference alone is insufficient to model the noises. We propose to look into point-set difference, which measures noises that not only remove/introduce new feature points in the biometric objects, but may also perturb the points. In this paper, we first give an improvement for set difference construction that can be extended to multi-sets, where the sketch is small and there is an efficient decoding algorithm. We next give a sketch for point-set difference in both one and two-dimensional spaces. By using results in almost k-wise independence, the size of the sketch is reduced to near-optimal.
منابع مشابه
A Secure Sketch for Set Reconciliation
In this paper we present an implementation of an algorithm for creating a secure sketch for the set difference as defined in [1]. This sketch is a short, efficiently computable description of a set such that, given a second set that differs only in a small percentage of elements, the original can be reconstructed. However, this sketch is secure in the sense that in the absence of such a similar...
متن کاملHiding Secret Points Amidst Chaff
Motivated by the representation of biometric and multimedia objects, we consider the problem of hiding noisy point-sets using a secure sketch. A point-set X consists of s points from a d-dimensional discrete domain [0, N−1]. Under permissible noises, for every point 〈x1, .., xd〉 ∈ X, each xi may be perturbed by a value of at most δ. In addition, at most t points in X may be replaced by other po...
متن کاملRobust Extraction of Secret Bits from Minutiae
Our goal is to extract consistent bits from the same fingerprint in a noisy environment. Such bits can then be used as a secret key in several cryptographic applications. In order to correct inevitable noise during scanning and processing, a known approach extracts and publishes an additional information, known as secure sketch from the minutiae. During subsequent scanning, the sketch aids in c...
متن کاملSecure Sketch for Multi-Sets
Given the original set X where |X| = s, a sketch P is computed from X and made public. From another set Y where |Y | = s and P , we can reconstruct X if |X ∩ Y | ≥ |s − t|, where t < s is some threshold. The sketch P is secure if it does not reveal much information about X. A few constructions have been proposed, but they cannot handle multi-sets, that is, sets that may contain duplicate elemen...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005